A geometrical representation theory for orthogonal arrays

نویسندگان

چکیده

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Geometrical Aspects of Representation Theory

1. Geometry of primitive ideals. 1.1. Let G be a complex algebraic group with Lie algebra g. I would like to have a geometric picture for the structure of primitive ideals of the enveloping algebra U(g). The only universal answer known so far is the "orbit method," saying that primitive ideals should correspond to coadjoint orbits in the dual g* of g. Sometimes this principle doesn't work, howe...

متن کامل

Geometrical Constructions for Ordered Orthogonal Arrays and (T, M, S)-Nets

The concept of a linear ordered orthogonal array is introduced, and its equivalent geometrical configuration is determined when its strength is 3 and 4. Existence of such geometrical configurations is investigated. They are also useful in the study of (T, M, S)-nets.

متن کامل

Orthogonal Arrays

Definition Orthogonal arrays (OAs) are objects that are most often generated via algebraic arguments. They have a number of applications in applied mathematics, and have often been studied by algebraic mathematicians as objects of interest in their own right. Our treatment will reflect their use as representations of statistical experimental designs. An OA is generally presented as a two-dimens...

متن کامل

Orthogonal Arrays

(say) is called symmetric, otherwise, the array is said to be asymmetric. Several methods of construction of symmetric as well as asymmetric OAs are available in the literature. Some important methods will be discussed here. One of the principal applications of the OAs is in the selection of level combinations for fractional factorial experiments. An OA of strength t is equivalent to an orthogo...

متن کامل

Hilbert Bases for Orthogonal Arrays

In this paper, we relate the problem of generating all 2-level orthogonal arrays of given dimension and force, i.e. elements in OA(n, m), where n is the number of factors and m the force, to the solution of an Integer Programming problem involving rational convex cones. We do not restrict the number of points in the array, i.e. we admit any number of replications. This problem can be theoretica...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Bulletin of the Australian Mathematical Society

سال: 1994

ISSN: 0004-9727,1755-1633

DOI: 10.1017/s0004972700016373